A branch and bound method solving the max–min linear discriminant analysis problem

A Multi Linear Discriminant Analysis Method Using a Subtraction Criteria

Linear dimension reduction has been used in different application such as image processing and pattern recognition. All these data folds the original data to vectors and project them to an small dimensions. But in some applications such we may face with data that are not vectors such as image data. Folding the multidimensional data to vectors causes curse of dimensionality and mixed the differe...

A Branch and Bound Algorithm for Solving the Binary Bi-level Linear Programming Problem

A Method for Solving Intuitionistic Fuzzy Assignment Problem Using Branch and Bound Method

In this paper, we investigate an assignment problem in which cost coefficients are triangular intuitionistic fuzzy numbers. In conventional assignment problem, cost is always certain. This paper develops an approach to solve an intuitionistic fuzzy assignment problem where cost is not deterministic numbers but imprecise ones. Here, the elements of the costs (profits) matrix of the assignment pr...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem

This paper deals with a special case of Project Scheduling problem: there is a project to schedule, which is made up of activities linked by precedence relations. Each activity requires specific skills to be done. Moreover, resources are staff members who master fixed skill(s). Thus, each resource requirement of an activity corresponds to the number of persons doing the corresponding skill that...